Persistence codebooks for topological data analysis
نویسندگان
چکیده
منابع مشابه
Persistence Codebooks for Topological Data Analysis
Topological data analysis, such as persistent homology has shown beneficial properties for machine learning in many tasks. Topological representations, such as the persistence diagram (PD), however, have a complex structure (multiset of intervals) which makes it difficult to combine with typical machine learning workflows. We present novel compact fixed-size vectorial representations of PDs bas...
متن کاملStatistical topological data analysis using persistence landscapes
We define a new topological summary for data that we call the persistence landscape. In contrast to the standard topological summaries, the barcode and the persistence diagram, it is easy to combine with statistical analysis, and its associated computations are much faster. This summary obeys a Strong Law of Large Numbers and a Central Limit Theorem. Under certain finiteness conditions, this al...
متن کاملPersistence weighted Gaussian kernel for topological data analysis
Topological data analysis (TDA) is an emerging mathematical concept for characterizing shapes in complex data. In TDA, persistence diagrams are widely recognized as a useful descriptor of data, and can distinguish robust and noisy topological properties. This paper proposes a kernel method on persistence diagrams to develop a statistical framework in TDA. The proposed kernel satisfies the stabi...
متن کاملConvergence rates for persistence diagram estimation in Topological Data Analysis
Computational topology has recently seen an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be natur...
متن کاملApplications of Zigzag Persistence to Topological Data Analysis
The theory of zigzag persistence is a substantial extension of persistent homology, and its development has enabled the investigation of several unexplored avenues in the area of topological data analysis. In this paper, we discuss three applications of zigzag persistence: topological bootstrapping, parameter thresholding, and the comparison of witness complexes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Review
سال: 2020
ISSN: 0269-2821,1573-7462
DOI: 10.1007/s10462-020-09897-4